Comparison of Techniques Used in Prioritized Mutual Exclusion by Groups
نویسنده
چکیده
The aim of this work is to allocate the critical section to distributed processes organized by groups having distinct priorities. Affectation can be made inside a group when there are not requests from groups having a greater priority. This paper discusses some techniques to do this in relation to architecture and number of messages. If there are requests issued from distinct groups, there must be an algorithm to decide which request has to be accepted. To do this, other techniques are required. Both, internal and external techniques are examined independently.
منابع مشابه
Prioritized Token-Based Mutual Exclusion for Distributed Systems
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment suitable for real-time applications but impose a higher message passing overhead than our approach. We present a new protocol for prioritized mutual exclusion in a distributed environment. Our approach uses a token-ba...
متن کاملDistributed Mutual Exclusion Token-Permission Based by Prioritized Groups
Sites with the same priority are gathered in the same group. Communication inside a group is organized in a logical rooted tree structure. The tree’s root is the site that last held the token. This organization is similar to that of Raymond's algorithm. For its external communications, a group resorts to an external supplementary element: a router. This router manages external communications. T...
متن کاملModel Checking Prioritized Token-Based Mutual Exclusion Algorithms
Many existing token-based, distributed mutual exclusion algorithms can be generalized by a single algorithm. The number of messages required to provide mutual exclusion is dependent upon the logical topology imposed on the nodes and the policy used to forward requests. This paper extends the generalized algorithm to support prioritized requests and presents models that can be used to analyze th...
متن کاملImprovement of the distributed algorithms of mutual exclusion by introducing the priority
Most of distributed mutual exclusion algorithms do not use the notion of priority. To solve the distributed prioritized mutual exclusion problem, F. Mueller[9] has already prioritized a token and tree based algorithm. The goal of this paper is to show the introduction of priority in an other token-based algorithm. This work can be considered an improvement of F.
متن کاملThe Prioritized and Distributed Synchronization in Distributed Groups
A simple and cheap algorithm is presented to allow prioritized mutual exclusion. There are several groups. All the members of a same group have the same level priority. Our algorithm is a token-based algorithm. Each group of participants (site) is represented by a tree structure. Inside a group, the requests are recorded in a global queue which circulates simultaneously and together with the to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001